Decidability of S 2 S MSc

Regular set of representatives for time-constrained MSC graphs

Systems involving both time and concurrency are notoriously difficult to analyze. Existing decidability results apply in settings where clocks on different processes cannot be compared or where the set of timed executions is regular. We prove new decidability results for timed concurrent systems, requiring neither restriction. We consider the formalism of time-constrained MSCgraphs (TC-MSC grap...

Symbolically Bounding the Drift in Time-Constrained MSC Graphs

Verifying systems involving both time and concurrency rapidly leads to undecidability, and requires restrictions to become effective. This paper addresses the emptiness problem for time-constrained MSC-Graphs (TC-MSC graphs for short), that is, checking whether there is a timed execution compatible with a TC-MSC graph specification. This problem is known to be undecidable in general [11], and d...

Decidability and Tameness in the Theory of Finite Semigroups

A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL

In two previous papers we have investigates the problem of computing the least common subsumer (lcs) and the most specific concept (msc) for the description logic EL in the presence of terminological cycles that are interpreted with descriptive semantics, which is the usual first-order semantics for description logics. In this setting, neither the lcs nor the msc needs to exist. We were able to...

Pure Computable Model Theory

2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. Introduction History Notation and basic definitions Decidable theories, and computable and decidable models Effective completeness theorem Model completeness and decidability Omitting types and decidability Decidable prime models Computable saturated models and computably saturated models Decidable homogeneous models Vaught's theorem computabl...